Parallel belief revision
نویسنده
چکیده
This paper describes a formal system of belief revision developed by Wolfgang Spohn and shows thai this system has a parallel implementation that can be derived from an influence diagram in a manner similar to that in which Bayesian networks are derived.
منابع مشابه
Parallel belief revision: Revising by sets of formulas
The area of belief revision studies how a rational agent may incorporate new information about a domain into its belief corpus. An agent is characterized by a belief stateK, and receives a new item of information α which is to be included among its set of beliefs. Revision then is a function from a belief state and a formula to a new belief state. We propose here a more general framework for be...
متن کاملParallel Belief Revision
A recalcitrant problem in approaches to iterated belief revision is that, after first revising by a formula and then by a formula that is inconsistent with the first formula, all information in the original formula is lost. As noted by various researchers, this phenomenon is made explicit in the second postulate (C2) of the well-known Darwiche-Pearl framework, and so this postulate has been a p...
متن کاملA Logic-based Model for uncertainty reduction: parallel processing
Geographic Information Systems (GIS) often use incomplete and uncertain information leading to inconsistency. Thus, a clear definition of information revision is required. In logic, most of the usual belief revision operations are characterized by a high computational complexity, which implies actual intractability even for rather small data sets. On the other hand, GIS deal with large amounts ...
متن کاملRanking Revision with Conditional Knowledge Bases
We introduce a new model for belief dynamics where the belief states are ranking measures and the informational inputs are finite sets of parametrized conditionals interpreted by ranking constraints. The approach is inspired by the minimal information paradigm and generalizes ranking construction strategies developed for default reasoning. We show its handling of principles for conditional and ...
متن کاملParallel interpolation, splitting, and relevance in belief change
The splitting theorem says that any set of formulae has a finest representation as a family of letter-disjoint sets. Parikh formulated this for classical propositional logic, proved it in the finite case, used it to formulate a criterion for relevance in belief change, and showed that AGM partial meet revision can fail the criterion. In this paper we make three further contributions. We begin b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1988